全文获取类型
收费全文 | 409篇 |
免费 | 24篇 |
国内免费 | 12篇 |
专业分类
化学 | 24篇 |
力学 | 10篇 |
综合类 | 4篇 |
数学 | 311篇 |
物理学 | 96篇 |
出版年
2024年 | 1篇 |
2023年 | 10篇 |
2022年 | 17篇 |
2021年 | 9篇 |
2020年 | 9篇 |
2019年 | 13篇 |
2018年 | 12篇 |
2017年 | 15篇 |
2016年 | 8篇 |
2015年 | 13篇 |
2014年 | 29篇 |
2013年 | 26篇 |
2012年 | 9篇 |
2011年 | 26篇 |
2010年 | 22篇 |
2009年 | 41篇 |
2008年 | 18篇 |
2007年 | 23篇 |
2006年 | 19篇 |
2005年 | 18篇 |
2004年 | 9篇 |
2003年 | 17篇 |
2002年 | 9篇 |
2001年 | 6篇 |
2000年 | 5篇 |
1999年 | 13篇 |
1998年 | 6篇 |
1997年 | 5篇 |
1996年 | 5篇 |
1995年 | 4篇 |
1994年 | 4篇 |
1993年 | 1篇 |
1992年 | 3篇 |
1991年 | 2篇 |
1989年 | 1篇 |
1988年 | 1篇 |
1987年 | 2篇 |
1986年 | 1篇 |
1985年 | 2篇 |
1984年 | 2篇 |
1982年 | 7篇 |
1980年 | 1篇 |
1969年 | 1篇 |
排序方式: 共有445条查询结果,搜索用时 15 毫秒
1.
2.
本文对一类具有对称轴的图A_n(n≥0),得到了它的特征多项式及匹配多项式的精确表达式;同时还得到A_(?)的完美匹配数。 相似文献
3.
Matthias Kriesell 《Graphs and Combinatorics》2002,18(1):133-146
Let k≤n be positive integers. A finite, simple, undirected graph is called k-critically n-connected, or, briefly, an (n,k)-graph, if it is noncomplete and n-connected and the removal of any set X of at most k vertices results in a graph which is not (n−|X|+1)-connected. We present some new results on the number of vertices of an (n,k)-graph, depending on new estimations of the transversal number of a uniform hypergraph with a large independent edge set.
Received: April 14, 2000 Final version received: May 8, 2001 相似文献
4.
This paper defines a set of material compatibility constraints for use in order promising mixed integer programs. The constraints always represent a necessary condition for compatibility and, in certain cases, are both necessary and sufficient. The underlying analysis represents incompatibilities using bipartite graphs and applies results from the perfectly matchable subgraph polytope. 相似文献
5.
Let G be a graph and f : V(G)→{1,3,5,…}. Then a subgraph H of G is called a (1,f)-odd subgraph if degH(x){1,3,…,f(x)} for all xV(H). If f(x)=1 for all xV(G), then a (1,f)-odd subgraph is nothing but a matching. A (1,f)-odd subgraph H of G is said to be maximum if G has no (1,f)-odd subgraph K such that |K|>|H|. We show that (1,f)-odd subgraphs have some properties similar to those of matchings, in particular, we give a formula for the order of a maximum (1,f)-odd subgraph, which is similar to that for the order of a maximum matching. 相似文献
6.
7.
In environmental chemistry studies, it may be necessary to analyze data sets constituted by different blocks of variables, possibly of different types, measured on the same samples. Multiple factor analysis (MFA) is presented as a tool for exploring such data. The most important features of MFA are shown on a real environmental data set, consisting of two blocks of data, namely heavy metals and polycyclic aromatic hydrocarbons, measured for sediment samples. They are discussed and compared to principal component analysis (PCA). The usefulness of the weighting scheme used in MFA as a preprocessing step for other chemometric methods, such as clustering, is also highlighted. 相似文献
8.
9.
Several reference priors and a general form of matching priors are derived for a stress–strength system, and it is concluded that none of the reference priors is a matching prior. The study shows that the matching prior performs better than Jeffreys prior and reference priors in meeting the target coverage probabilities. 相似文献
10.